By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 18, Issue 1, pp. 1-217

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Codes Closed under Arbitrary Abelian Group of Permutations

Bikash Kumar Dey and B. Sundar Rajan

pp. 1-18

BibTeX  Abstract Full Text:  PDF

Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer

Ching-Chi Lin, Hsueh-I Lu, and I-Fan Sun

pp. 19-29

BibTeX  Abstract Full Text:  PDF

On the Hardness of 4-Coloring a 3-Colorable Graph

Venkatesan Guruswami and Sanjeev Khanna

pp. 30-40

BibTeX  Abstract Full Text:  PDF

An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph

Harold N. Gabow

pp. 41-70

BibTeX  Abstract Full Text:  PDF

Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings

C. R. Miers and F. Ruskey

pp. 71-82

BibTeX  Abstract Full Text:  PDF

Recognizing Powers of Proper Interval, Split, and Chordal Graphs

Lap Chi Lau and Derek G. Corneil

pp. 83-102

BibTeX  Abstract Full Text:  PDF

Small Examples of Nonconstructible Simplicial Balls and Spheres

Frank H. Lutz

pp. 103-109

BibTeX  Abstract Full Text:  PDF

A Note on Bandits with a Twist

Akshay-Kumar Katta and Jay Sethuraman

pp. 110-113

BibTeX  Abstract Full Text:  PDF

The Nonapproximability of Non-Boolean Predicates

Lars Engebretsen

pp. 114-129

BibTeX  Abstract Full Text:  PDF

On Decimations of $\ell$-Sequences

Mark Goresky, Andrew Klapper, Ram Murty, and Igor Shparlinski

pp. 130-140

BibTeX  Abstract Full Text:  PDF

Exact Word-Run Statistics in Random Orderings

Gabriel A. Schachtel

pp. 141-158

BibTeX  Abstract Full Text:  PDF

A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs

Jurriaan Hage and Tero Harju

pp. 159-176

BibTeX  Abstract Full Text:  PDF

On the Number of Minimum Cuts in a Graph

L. Sunil Chandran and L. Shankar Ram

pp. 177-194

BibTeX  Abstract Full Text:  PDF

On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree

V. Lozin and D. Rautenbach

pp. 195-206

BibTeX  Abstract Full Text:  PDF

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem

Alexander Ageev, Yinyu Ye, and Jiawei Zhang

pp. 207-217

BibTeX  Abstract Full Text:  PDF